A new result of the scaling law of weighted L1 minimization
نویسندگان
چکیده
Abstract—This paper study recovery conditions of weighted l1 minimization for signal reconstruction from compressed sensing measurements. A sufficient condition for exact recovery by using the general weighted l1 minimization is derived, which builds a direct relationship between the weights and the recoverability. Simulation results indicates that this sufficient condition provides a precise prediction of the scaling law for the weighted l1 minimization.
منابع مشابه
Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
The l0-minimization problem that seeks the sparsest point of a polyhedral set is a longstanding challenging problem in the fields of signal and image processing, numerical linear algebra and mathematical optimization. The weighted l1-method is one of the most plausible methods for solving this problem. In this paper, we develop a new weighted l1-method through the strict complementarity theory ...
متن کاملTHE SCALING LAW FOR THE DISCRETE KINETIC GROWTH PERCOLATION MODEL
The Scaling Law for the Discrete Kinetic Growth Percolation Model The critical exponent of the total number of finite clusters α is calculated directly without using scaling hypothesis both below and above the percolation threshold pc based on a kinetic growth percolation model in two and three dimensions. Simultaneously, we can calculate other critical exponents β and γ, and show that the scal...
متن کاملExact Recovery for Sparse Signal via Weighted l_1 Minimization
Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...
متن کاملRecovery of signals by a weighted $\ell_2/\ell_1$ minimization under arbitrary prior support information
In this paper, we introduce a weighted l2/l1 minimization to recover block sparse signals with arbitrary prior support information. When partial prior support information is available, a sufficient condition based on the high order block RIP is derived to guarantee stable and robust recovery of block sparse signals via the weighted l2/l1 minimization. We then show if the accuracy of arbitrary p...
متن کاملAnalyzing Weighted $\ell_1$ Minimization for Sparse Recovery with Nonuniform Sparse Models\footnote{The results of this paper were presented in part at the International Symposium on Information Theory, ISIT 2009}
In this paper we introduce a nonuniform sparsity model and analyze the performance of an optimized weighted l1 minimization over that sparsity model. In particular, we focus on a model where the entries of the unknown vector fall into two sets, with entries of each set having a specific probability of being nonzero. We propose a weighted l1 minimization recovery algorithm and analyze its perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.07947 شماره
صفحات -
تاریخ انتشار 2015